Dynamic Logic Assigned to Automata

An Automata Theoretic Approach to Temporal Logic

A syntax directed mapping is presented from Propositional Temporal Logic (PTL) formulae to Müller type finite automata. This is a direct and much more elegant and easier to implement approach than previously described methods. Most of these methods are based on tableau methods for satisfiability checking, and after that a Büchi type of automaton is extracted. Büchi and Müller automata are equal...

Automata Theory Approach to Predicate Intuitionistic Logic

Predicate intuitionistic logic is a well established fragment of dependent types. According to the Curry-Howard isomorphism proof construction in the logic corresponds well to synthesis of a program the type of which is a given formula. We present a model of automata that can handle proof construction in full intuitionistic first-order logic. The automata are constructed in such a way that any ...

From Timed Automata to Logic - and Back

One of the most successful techniques for automatic verification is that of model checking. For finite automata there exist since long extremely efficient model–checking algorithms, and in the last few years these algorithms have been made applicable to the verification of real–time automata using the region–techniques of Alur and Dill. In this paper, we continue this transfer of existing techn...

Characteristic Formulae: From Automata to Logic

This paper discusses the classic notion of characteristic formulae for processes using variations on Hennessy-Milner logic as the underlying logical specification language. It is shown how to characterize logically (states of) finite labelled transition systems modulo bisimilarity using a single formula in Hennessy-Milner logic with recursion. Moreover, characteristic formulae for timed automat...

Automata and Logic